Evidential Reasoning with Conditional Belief Functions
نویسندگان
چکیده
In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two kinds of representations. We also present a propagation algorithm for such networks. By analyzing the properties of some special evidential networks with conditional belief functions, we show that the reasoning process can be simplified in such
منابع مشابه
Approximate Evidential Reasoning Using Local Conditioning and Conditional Belief Functions
We propose a new message-passing belief propagation method that approximates belief updating on evidential networks with conditional belief functions. By means of local conditioning, the method is able to propagate beliefs on the original multiply-connected network structure using local computations, facilitating reasoning in a distributed and dynamic context. Further, by use of conditional bel...
متن کاملA Reasoning Method in Conditional Evidential Networks based on Dezert-Smarandache Model
Aiming to solving the problem that the evidence information based on Dezert-Smarandache (DSm) model can not be fused effectively in Conditional Evidential Network based on Smets/DS model (ENC), a reasoning method in Conditional Evidential Network based on DSm model is proposed. First, the conditional reasoning formular in Conditional Evidential Network based on DSm model is proved and the reaso...
متن کاملOn the Complexity of the Graphical Representation and the Belief Inference in the Dynamic Directed Evidential Networks with Conditional Belief Functions
Directed evidential graphical models are important tools for handling uncertain information in the framework of evidence theory. They obtain their efficiency by compactly representing (in)dependencies between variables in the network and efficiently reasoning under uncertainty. This paper presents a new dynamic evidential network for representing uncertainty and managing temporal changes in dat...
متن کاملBelief Function Propagation in Directed Evidential Networks
In this paper, we propose a computational data structure based on the binary join tree where the independence relations of the original directed evidential networks (DEVN) are maintained. The proposed solution uses disjunctive rule of combination (DRC) and generalized Bayesian theorem (GBT), which make possible the use of the conditional belief functions directly for reasoning in the DEVN.
متن کاملA Comparison of Architectures for Exact Inference in Evidential Networks
This paper presents a comparison of two architectures for belief propagation in evidential networks, namely the binary join tree using joint belief functions [9] and the modified binary join tree using conditional belief functions [2]. This comparison is done from the perspective of graphical structure, messagepassing scheme, computational efficiency, storage efficiency, and complexity analysis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994